Second Order Converse Duality for Nonlinear Programming
نویسندگان
چکیده
Chandra and Abha [European J. Oper. Res. 122 (2000), 161-165] considered a nonlinear programming problem over cone constraints and presented the correct forms of its four types of duals formulated by Nanda and Das [European J. Oper. Res. 88 (1996) 572-577]. Yang et al. [Indian J. Pure Appl. Math. 35 (2004), 699-708] considered the same problem and discussed weak and strong duality for its four types of second order duals under the assumptions of generalized second order F-convexity. In this paper, we are intended to prove converse duality theorems for second order duals of Yang et al.
منابع مشابه
Duality in nonlinear programming
In this paper are defined new firstand second-order duals of the nonlinear programming problem with inequality constraints. We introduce a notion of a WD-invex problem. We prove weak, strong, converse, strict converse duality, and other theorems under the hypothesis that the problem is WD-invex. We obtain that a problem with inequality constraints is WD-invex if and only if weak duality holds b...
متن کاملSecond Order Duality in Multiobjective Programming
A nonlinear multiobjective programming problem is considered. Weak, strong and strict converse duality theorems are established under generalized second order (F, α, ρ, d)-convexity for second order Mangasarian type and general Mond-Weir type vector duals.
متن کاملContinuous Optimization Multiobjective second - order symmetric duality with F - convexity q
We suggest a pair of second-order symmetric dual programs in multiobjective nonlinear programming. For these second-order symmetric dual programs, we prove the weak, strong and converse duality theorems under F -convexity conditions. 2004 Elsevier B.V. All rights reserved.
متن کاملOn second-order converse duality for a nondifferentiable programming problem
A second-order dual for a nonlinear programming problem was introduced by Mangasarian ([1]). Later, Mond [2] proved duality theorems under a condition which is called “second-order convexity”. This condition is much simpler than that used by Mangasarian. Later, Mond and Weir [3] reformulated the second-order dual. In [4], Mond considered the class of nondifferentiable mathematical programming p...
متن کاملFritz john second-order duality for nonlinear programming
Abstract-A second-order dual to a nonlinear programming problem is formulated. This dual uses the Ritz John necessary optimality conditions instead of the Karush-Kuhn-Tucker necessary optimal&y conditions, and thus, does not require a constraint qualification. Weak, strong, strictconverse, and converse duality theorems between primal and dual problems are established. @ 2001 Elsevier Science Lt...
متن کامل